Efficient Implementation of the Multishift QR Algorithm for the Unitary Eigenvalue Problem
نویسندگان
چکیده
We present an efficient implementation of the multi-shift QR algorithm for computing the eigenvalues of a unitary matrix. The algorithm can perform QR iterations of arbitrary degree, it is conceptually simple, and it is backward stable.
منابع مشابه
A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
In 1989, Bai and Demmel proposed the multishift QR algorithm for eigenvalue problems. Although the global convergence property of the algorithm (i.e., the convergence from any initial matrix) still remains an open question for general nonsymmetric matrices, in 1992 Jiang focused on symmetric tridiagonal case and gave a global convergence proof for the generalized Rayleigh quotient shifts. In th...
متن کاملMultishift Variants of the QZ Algorithm with Aggressive Early Deflation
Abstract. New variants of the QZ algorithm for solving the generalized eigenvalue problem are proposed. An extension of the small-bulge multishift QR algorithm is developed, which chases chains of many small bulges instead of only one bulge in each QZ iteration. This allows the effective use of level 3 BLAS operations, which in turn can provide efficient utilization of high performance computin...
متن کاملParallel library software for the multishift QR algorithm with aggressive early deflation
Library software implementing a parallel small-bulge multishift QR algorithm with aggressive early deflation (AED) targeting distributed memory high-performance computing systems is presented. Starting from recent developments of the parallel multishift QR algorithm [Granat et al., SIAM J. Sci. Comput. 32(4), 2010], we describe a number of algorithmic and implementation improvements. These incl...
متن کاملA multiple shift QR-step for structured rank matrices
Eigenvalue computations for structured rank matrices are the subject of many investigations nowadays. There exist methods for transforming matrices into structured rank form, QR-algorithms for semiseparable and semiseparable plus diagonal form, methods for reducing structured rank matrices efficiently to Hessenberg form and so forth. Eigenvalue computations for the symmetric case, involving sem...
متن کاملOn Aggressive Early Deflation in Parallel Variants of the QR Algorithm
The QR algorithm computes the Schur form of a matrix and is by far the most popular approach for solving dense nonsymmetric eigenvalue problems. Multishift and aggressive early deflation (AED) techniques have led to significantly more efficient sequential implementations of the QR algorithm during the last decade. More recently, these techniques have been incorporated in a novel parallel QR alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 28 شماره
صفحات -
تاریخ انتشار 2006